Finite Complete Rewriting Systems for the Monoids M, ρ, and M/ρ
نویسندگان
چکیده
Let
منابع مشابه
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation type, being automatic, and being biautomatic are investigated for this class of monoids. The first main result shows that for any consistent combination of t...
متن کاملFinite Complete Rewriting Systems and Finite Derivation Type for Small Extensions of Monoids
Let S be a monoid and let T be a submonoid of nite index in S. The main results in this paper state that S can be presented by a nite complete rewriting system if T can, and S has nite derivation type if T has.
متن کاملCrystal bases , finite complete rewriting systems , and
This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homolog...
متن کاملCrystal bases, finite complete rewriting systems, and biautomatic structures for Plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$
This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homolog...
متن کاملA new finiteness condition for monoids presented by complete rewriting systems ( after Craig
Recently, Craig Squier introduced the notion of finite derivation type to show that some finitely presentable monoid has no presentation by means of a finite complete rewriting system. A similar result was already obtained by the same author using homology, but the new method is more direct and more powerful. Here, we present Squier’s argument with a bit of categorical machinery, making proofs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü dergisi
سال: 2023
ISSN: ['2687-3729']
DOI: https://doi.org/10.47495/okufbed.1093331